Using coalgebra and coinduction to define ontology-based multi-agent systems
نویسندگان
چکیده
In the past, algebra has been predominantly used to define computer systems. However, computer systems are becoming more dynamic nowadays and algebra is not suitable anymore to define such systems. For this reason, coalgebra and coinduction have been introduced into the computer and information society. Coalgebra and coinduction present a powerful mechanism for representing many different kinds of dynamic systems using a common formal framework. Some dynamic systems, such as streams, automata and formal power series, have been viewed coalgebraically. However, ontology-based multiagent systems have not been viewed coalgebraically yet. That is the aim of this paper. We make use of coinductive reasoning to provide a framework and define a dynamic process within the ontology-based multi-agent system. The principle is illustrated on an ontologybased multi-agent system specially designed to retrieve human disease information intelligently from a variety of heterogeneous and distributed information resources.
منابع مشابه
Control of Discrete-Event Systems with Partial Observations Using Coalgebra and Coinduction
Control of discrete-event systems with partial observations is treated by concepts and results of coalgebra and coinduction. Coalgebra is part of abstract algebra and enables a generalization of the computer science concept of bisimulation. It can be applied to automata theory and then provides a powerful algebraic tool to treat problems of supervisory control. A framework for control of discre...
متن کاملAn Executive Approach Based On the Production of Fuzzy Ontology Using the Semantic Web Rule Language Method (SWRL)
Today, the need to deal with ambiguous information in semantic web languages is increasing. Ontology is an important part of the W3C standards for the semantic web, used to define a conceptual standard vocabulary for the exchange of data between systems, the provision of reusable databases, and the facilitation of collaboration across multiple systems. However, classical ontology is not enough ...
متن کاملAutomata and Coinduction (an Exercise in Coalgebra) Automata and Coinduction (an Exercise in Coalgebra)
The classical theory of deterministic automata is presented in terms of the notions of homomor-phism and bisimulation, which are the cornerstones of the theory of (universal) coalgebra. This leads to a transparent and uniform presentation of automata theory and yields some new insights, amongst which coinduction proof methods for language equality and language inclusion. At the same time, the p...
متن کاملCoalgebra and coinduction in discrete - event control with partial observations
CWI's research has a theme-oriented structure and is grouped into four clusters. Listed below are the names of the clusters and in parentheses their acronyms. ABSTRACT Coalgebra and coinduction provide new results and insights for the supervisory control of discrete-event systems (DES) with partial observations. The paper is based on the formalism developed for supervisory control of DES in the...
متن کاملCoalgebraic Analysis of Subgame-perfect Equilibria in Infinite Games without Discounting
We present a novel coalgebraic formulation of infinite extensive games. We define both the game trees and the strategy profiles by possibly infinite systems of corecursive equations. Certain strategy profiles are proved to be subgame perfect equilibria using a novel proof principle of predicate coinduction. We characterize all subgame perfect equilibria for the dollar auction game. The economic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJMSO
دوره 3 شماره
صفحات -
تاریخ انتشار 2008